Why AI + ILP Is Good for WCET, but MC Is Not, Nor ILP Alone
نویسنده
چکیده
A combination of Abstract Interpretation (AI) with Integer Linear Programming (ILP) has been successfully used to determine precise upper bounds on the execution times of real-time programs. This article gives the answer to the frequently encountered claim, “one could have done it by Model Checking!” (MC). It shows that it is the characteristic property of abstract interpretation, namely that it proves as many safety properties as it can during its fixpoint iteration, which proves AI to be applicable and successful. On the other hand, MC’s need for a specification of the safety properties to be verified makes it unsuitable for the task. ILP alone has also been used to model a processor architecture and a program whose upper bounds for execution times was to be determined. It is argued why the only ILP-only approach found in the literature has not led to success.
منابع مشابه
بررسی تأثیر نرم کننده پرانرژی مایع یونی بر پایه ایمیدازولیوم بر خواص حرارتی نیتروسلولز
In this paper investigates an energetic imidazolium ionic liquid plasticizer (ILP) effect on the degradation kinetics of nitrocellulose, which is a important component of double based solid propellants. For better comparison and evaluation, diethyl phthalate (DEP) plasticizer, which has a structure similar to ILP, was also evaluated. Heat of combustion analysis was performed to evaluate the en...
متن کاملImproving the WCET computation time by IPET using control flow graph partitioning
Implicit Path Enumeration Technique (IPET) is currently largely used to compute Worst Case Execution Time (WCET) by modeling control flow and architecture using integer linear programming (ILP). As precise architecture effects requires a lot of constraints, the super-linear complexity of the ILP solver makes computation times bigger and bigger. In this paper, we propose to split the control flo...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملCode Size Aware Compilation for Real-Time Applications
Statically constructed plan of execution (POE) and aggressive instruction level parallelism (ILP) exploitation make EPIC/VLIW processors appropriate for high performance real-time systems. On the one hand, the compiler controlled POE makes the worst-case execution-time (WCET) analysis more accurate as run-time variations are minimized. On the other hand, the compiler can leverage ILP optimizati...
متن کاملناحیه جواب جدید برای حل مدل برنامه ریزی خطی بازه ای
We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004